The fixed point property and a technique to harness double fixed point combinators
نویسندگان
چکیده
منابع مشابه
fixed point property for banach algebras associated to locally compact groups
در این پایان نامه به بررسی خاصیت نقطه ثابت و خاصیت نقطه ثابت برای نیم گروههای برگشت پذیر چپ روی بعضی جبرهای باناخ از جمله جبر فوریه و جبر فوریه استیلتیس پرداخته شده است. برای مثال بیان شده است که اگر گروه یک گروه فشرده موضعی با همسایگی فشرده برای عنصر همانی که تحت درونریختی ها پایاست باشد آنگاه جبر فوریه و جبر فوریه استیلتیس دارای خاصیت نقطه ثابت برای نیم گروه های برگشت پذیر چپ است اگر و تنها ا...
15 صفحه اولShorter Fixed Point Combinators with WALDMEISTER and the Kernel Strategy
From the AAR President Shorter Fixed Point Combinators with WALDMEISTER and the Kernel Strategy Generation of NAFILs of Order 7 News from CADE Inc. CADE Elections CADE-17 Workshops Call for Papers FTP’2000 Call for Problem Sets Calls for Papers AiML-ICTL 2000 ADG New Books Term Rewriting and All That A Fascinating Country in the World of Computing TPTP Library Announcements The TPTP Problem Lib...
متن کاملDismantlable Digraphs and the Fixed Point Property
In this paper, the concept of continuous multifunctions for digraphs is introduced. It turns out that a digraph multifunction is continuous if and only if it is strong. We introduce the notion of dismantlable digraphs and show that it does generalize the dismantlable graphs and posets. Generalizing various previous results, we show that any dismantlable digraph has the almost fixed point proper...
متن کاملHomotopies and the Universal Fixed Point Property
A topological space is said to have the fixed point property if every continuous self-map of it has at least one fixed point. In this text, we investigate the additional restraints imposed by the requirement that a fixed point can be chosen continuously when the self-map is varied continuously. While we are able to present a class of universal fixed point spaces, where this is always possible, ...
متن کاملThe Complexity of the Fixed Point Property
It is NP-complete to determine whether a given ordered set has a fixed point free orderpreserving self-map. On the way to this result, we establish the NP-completeness of a related problem: Given ordered sets P and Q with t-tuples (PI,. ,pt) and (41,. . , qt) from P and Q respectively, is there an order-preserving map f: P + Q satisfying f(pz) > qr for each i = l,...,t? Mathematics Subject Clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2019
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exz013